Absolute n-fold hyperspace suspensions
نویسندگان
چکیده
منابع مشابه
n-fold Commutative Hyper K-ideals
In this paper, we aresupposed to introduce the definitions of n-fold commutative, andimplicative hyper K-ideals. These definitions are thegeneralizations of the definitions of commutative, andimplicative hyper K-ideals, respectively, which have been definedin [12]. Then we obtain some related results. In particular wedetermine the relationships between n-fold implicative hyperK-ideal and n-fol...
متن کاملn-fold Obstinate Filters in Pseudo-Hoop Algebras
In this paper, we introduce the concepts of n-fold obstinate pseudo-hoop and n-fold obstinate filter in pseudo-hoops. Then we investigated these notions and proved some properties of them. Also, we discussed the relationship between n-fold obstinate pseudo-hoop and n-fold obstinate filter and other types of n-fold pseudo-hoops and n-fold filters such as n-fold (positive) implicative filter and ...
متن کاملCombinatoric N-fold Categories and N-fold Operads
Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the associativity that must be a property of the action of an operad on any of its algebras. A sequence of categorical types that filter the category of monoidal cat...
متن کاملCombinatorial N-fold Monoidal Categories and N-fold Operads
Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the associativity that must be a property of the action of an operad on any of its algebras. A sequence of categorical types that filter the category of monoidal cat...
متن کاملN-Fold Integer Programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time solvable. Our proof involves two heavy ingredients discovered recently: the equivalence of linear optimization and so-called directed augmentation, and the stabilization of certain Graver bases. We discuss several appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2006
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm105-2-5